Information spreading in dynamic graphs
نویسندگان
چکیده
منابع مشابه
Information Spreading in Dynamic Networks
We study the fundamental problem of information spreading (also known as gossip) in dynamic networks. In gossip, or more generally, k-gossip, there are k pieces of information (or tokens) that are initially present in some nodes and the problem is to disseminate the k tokens to all nodes. The goal is to accomplish the task in as few rounds of distributed computation as possible. The problem is ...
متن کاملInformation spreading on dynamic social networks
Nowadays, information spreading on social networks has triggered an explosive attention in various disciplines. Most of previous works in this area mainly focus on discussing the effects of spreading probability or immunization strategy on static networks. However, in real systems, the peer-to-peer network structure changes constantly according to frequently social activities of users. In order...
متن کاملFast Information Spreading in Graphs with a Large Weak Conductance
Gathering data from nodes in a network is at the heart of many distributed applications, most notably, while performing a global task. We consider information spreading among n nodes of a network, where each node v has a message m(v) which must be received by all other nodes. The time required for information spreading has been previously upper-bounded with an inverse relationship to the conduc...
متن کاملInformation Spreading in Dynamic Networks Under Oblivious Adversaries
We study the problem of all-to-all information exchange, also known as gossip, in dynamic networks controlled by an adversary that can modify the network arbitrarily from one round to another, provided that the network is always connected. In the gossip problem, there are n tokens arbitrarily distributed among the n network nodes, and the goal is to disseminate all the n tokens to every node. O...
متن کاملInformation Spreading in Dynamic Networks: An Analytical Approach
Sensor networks is one of the most relevant concrete examples of dynamic networks. Their dynamic behaviour is mainly due to the presence of node/link faults and node mobility. The aim of this chapter is to survey a new approach to study such dynamic networks, recently introduced in [15–19]. The major novelty of this approach relies on two basic issues. 1. The dynamic network is modeled as an ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2014
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-014-0219-2